A COMPLETE HISTOGRAM OF AN IMAGE IN LOG ( ) n STEPS AND MINIMUM EXPECTED MEMORY REQUIREMENTS USING HYPERCUBES
نویسنده
چکیده
This work first reviews an already-developed, existing deterministic parallel algorithm [2] to compute the complete histogram of an image in optimal number of steps ( ) n log on a hypercube architecture and utilizing memory space on the order of ( ), log 2 1 x x O where x is the number of gray levels in the image, at each processing element. The paper then introduces our improvement to this algorithm’s memory requirements by introducing the concept of randomization into the algorithm.
منابع مشابه
Computing a complete histogram of an image in Log(n) steps and minimum expected memory requirements using hypercubes
The first algorithm [1] to be reviewed in this paper is concerned with the task of computing the complete histogram of n gray-level values in n log steps. The algorithm is described for hypercubes and computes the complete histogram in n log time independent of the range of gray level values. The computation of the complete histogram of n such values takes place in a series of n log steps; afte...
متن کاملGossiping in Minimal Time
The gossip problem involves communicating a unique item from each node in a graph to every other node. We study the minimum time required to do this under the weakest model of parallel communication which allows each node to participate in just one communication at a time as either sender or receiver. We study a number of topologies including the complete graph, grids, hypercubes and rings. Dee...
متن کاملA Study on Histogram Equalization for MRI Brain Image Enhancement
Magnetic resonance imaging (MRI) of the brain is a precious tool to facilitate physician’s diagnoses and care for a mixture of brain diseases including stroke, cancer, and epilepsy. It presents exact information to discover the diseases. Histogram equalization is one of the important steps in image enhancement technique for MRI. This paper compares different methods like Brightness Preserving B...
متن کاملRouting Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In this paper, we study the routing numbers of cycles, complete bipartite graphs, and hypercubes. We prove that rt(Cn) = n − 1 (for n ≥ 3) and for s ≥ t, rt(Ks,t) = 3s 2t + O(1). We also prove n + 1 ≤ rt(Qn) ≤ 2n − 2 for ...
متن کاملOn The Rearrangeability Of Hypercubes Networks Characterization Of Some Non-1-Partitionable Permutations On 4D-hypercubes
This paper addresses the problem of the nDhypercubes interconnection networks rearrangeability that is the capability of such networks to route optimally arbitrary permutations under queueless communication constraints. The k-partitioning is an unifying paradigm of such routing. For a permutation which is not constituted of two sub-permutations on two disjoint (n-1)D-hypercubes of the nD-hyperc...
متن کامل